Enter a word or phrase in any language 👆
Language:
Translation and analysis of words by ChatGPT artificial intelligence
On this page you can get a detailed analysis of a word or phrase, produced by the best artificial intelligence technology to date:
- how the word is used
- frequency of use
- it is used more often in oral or written speech
- word translation options
- usage examples (several phrases with translation)
- etymology
RFL typing - translation to russian
MAJOR CLASS OF TYPE SYSTEM, IN WHICH COMPATIBILITY AND EQUIVALENCE OF DATA TYPES IS DETERMINED BY EXPLICIT DECLARATIONS AND/OR THE NAME OF THE TYPES
Nominative typing; Nominal typing; Nominative type system
RFL typing
общая лексика
типирование по длине фрагментов рестрикции
type error
SET OF RULES THAT ASSIGN A PROPERTY CALLED TYPE TO VARIOUS CONSTRUCTS A COMPUTER PROGRAM CONSISTS OF, SUCH AS VARIABLES, EXPRESSIONS, FUNCTIONS OR MODULES
Dynamic typing; Static typing; Type systems; Type checking; Type-checking; Dynamically typed; Statically typed language; Dynamically typed language; Typed language; Dynamically-typed; Statically typed; Compile-time type checking; Statically-typed; Dynamicly typed; Dynamic data typing; Typed (programming languages); Static-typing (programming languages); Typechecker; Type checker; Type-checker; Static type; Static types; Type equivalence; Statically typed programming language; Statically-typed programming language; Dynamically-typed language; Existential type; Existential types; Type error; Typing discipline; Static type system; Optional typing; Typechecking; Static type-checking; Static type checking; Runtime type checking; Run-time type checking; Dynamic type checking; Optional type systems; Computational type system; Unified type system; Optional static typing; Dynamic type
ошибка при наборе
typed language
SET OF RULES THAT ASSIGN A PROPERTY CALLED TYPE TO VARIOUS CONSTRUCTS A COMPUTER PROGRAM CONSISTS OF, SUCH AS VARIABLES, EXPRESSIONS, FUNCTIONS OR MODULES
Dynamic typing; Static typing; Type systems; Type checking; Type-checking; Dynamically typed; Statically typed language; Dynamically typed language; Typed language; Dynamically-typed; Statically typed; Compile-time type checking; Statically-typed; Dynamicly typed; Dynamic data typing; Typed (programming languages); Static-typing (programming languages); Typechecker; Type checker; Type-checker; Static type; Static types; Type equivalence; Statically typed programming language; Statically-typed programming language; Dynamically-typed language; Existential type; Existential types; Type error; Typing discipline; Static type system; Optional typing; Typechecking; Static type-checking; Static type checking; Runtime type checking; Run-time type checking; Dynamic type checking; Optional type systems; Computational type system; Unified type system; Optional static typing; Dynamic type
общая лексика
язык с контролем типов, типизированный язык
вычислительная техника
язык символический
Смотрите также
Definition
duck typing
<programming> A term coined by Dave Thomas for a kind of
dynamic typing typical of some programming languages, such
as Smalltalk, Ruby or Visual FoxPro, where a
variable's run-time value determines the operations that
can be performed on it.
The term comes from the "duck test": if it walks like a duck
and quacks like a duck, it must be a duck.
Duck typing considers the methods to which a value responds
and the attributes it posesses rather than its relationship
to a type hierarchy. This encourages greater polymorphism
because types are enforced as late as possible.
http://blade.nagaokaut.ac.jp/cgi-bin/scat.rb/ruby/ruby-talk/100511.
(2006-09-13)
Wikipedia
Nominal type system
In computer science, a type system is a nominal or nominative type system (or name-based type system) if compatibility and equivalence of data types is determined by explicit declarations and/or the name of the types. Nominal systems are used to determine if types are equivalent, as well as if a type is a subtype of another. Nominal type systems contrast with structural systems, where comparisons are based on the structure of the types in question and do not require explicit declarations.
